Formal proofs of operator identities by a single formal computation

A formal computation proving a new operator identity from known ones is, in principle, restricted by domains and codomains of linear operators involved, since not any two operators can be added or composed. Algebraically, identities can be modelled by noncommutative polynomials and such a formal computation proves that the polynomial corresponding to the new identity lies in the ideal generated by the polynomials corresponding to the known identities. In order to prove an operator identity, however, just proving membership of the polynomial in the ideal is not enough, since the ring of noncommutative polynomials ignores domains and codomains. We show that it suffices to additionally verify compatibility of this polynomial and of the generators of the ideal with the labelled quiver that encodes which polynomials can be realized as linear operators. Then, for every consistent representation of such a quiver in a linear category, there exists a computation in the category that proves the corresponding instance of the identity. Moreover, by assigning the same label to several edges of the quiver, the algebraic framework developed allows to model different versions of an operator by the same indeterminate in the noncommutative polynomials.     

Extension of Laguerre polynomials with negative arguments

We consider the irreducibility of polynomial $L_n^{\left(\alpha \right)}\left(x\right)$ where $\alpha$ is a negative integer. We observe that the constant term of $L_n^{\left(\alpha \right)}\left(x\right)$ vanishes if and only if $n\ge \left|\alpha \right|=?\alpha$. Therefore we assume that $\alpha =?n?s?1$ where $s$ is a non-negative integer. Let $g\left(x\right)={(?1)}^n{L}_n^{(?n?s?1)}\left(x\right)=\sum _{j=0}^n{a}_j\frac{x^j}{j!}$ and more general polynomial, let $G\left(x\right)=\sum _{j=0}^n{a}_j{b}_j\frac{x^j}{j!}$ where $b_j$ with $0\le j\le n$ are integers such that $\left|b_0\right|=\left|b_n\right|=1$. Schur was the first to prove the irreducibility of $g\left(x\right)$ for $s=0$. It has been proved that $g\left(x\right)$ is irreducible for $0\le s\le 60$. In this paper, by a different method, we prove: Apart from finitely many explicitly given possibilities, either $G\left(x\right)$ is irreducible or $G\left(x\right)$ is linear factor times irreducible polynomial. This is a consequence of the estimate $s>1.9k$ whenever $G\left(x\right)$ has a factor of degree $k\ge 2$ and $(n,k,s)\ne (10,5,4)$. This sharpens earlier estimates of Shorey and Tijdeman and Nair and Shorey.     

Bilateral generating functions and operational methods

Bilateral generating functions are those involving products of different types of polynomials. We show that operational methods offer a powerful tool to derive these families of generating functions. We study cases relevant to products of Hermite polynomials with Laguerre, Legendre and other polynomials. We also propose further extensions of the method which we develop here.     

A new approach to obtain the non-Condon factors in closed form for two one-dimensional harmonic oscillators

A simple algebraic approach to calculate general Franck-Condon overlaps is extended to evaluate non-Condon factors for two one-dimensional harmonic oscillators. The method is based on the use of eigenstates of the harmonic oscillator annihilation operator which allows to obtain in terms of a multi-dimensional Hermite polynomial the overlap of harmonic oscillator functions associated with different Born-Oppenheimer potentials. The presented approach is self-contained, only basic concepts of quantum mechanics associated with the harmonic oscillator system are needed. The obtained expression for the Franck-Condon overlaps is similar to the Ansbacher’s formula and equivalent to the one calculated by Malkin and Man’ko. However our final expression has the advantages that only real numbers are involved and it is straightforward to get the limit case of equal frequencies. Concerning the non-Condon factors two approaches leading to different formulas are considered, both of which reduce to triple sums of products of three Hermite polynomials.     

ON THE RATE OF WEIGHTED Lp CONVERGENCE BY THE GRUENWALD INTERPOLATORY OPERATORS

This paper gives the weighted Lp convergence rate estimations of the Gruenwald interpolatory polynomials based on the zeros of Chebyshev polymomials of the first kind,and proves that the order of the estimations is optimal for p≥1.     

微分代数多项式系统的可解集

本文对一般微分代数方程给出了几类可解集的概念，并讨论了多项式微分代数方程的可解集，得到子多项式系统具有唯一解。特别是有多于一个的解的条件，并得到了低次多项式在一定意义下的充分必要条件。     

Moments of an exponential functional of random walks and permutations with given descent sets

The exponential functional of simple, symmetric random walks with negative drift is an infinite polynomial Y = 1 + ξ₁ + ξ₁ξ₂ + ξ₁ξ₂ξ₃ + ⋯ of independent and identically distributed non-negative random variables. It has moments that are rational functions of the variables μ _k = E(ξ ^k ) < 1 with universal coefficients. It turns out that such a coefficient is equal to the number of permutations with descent set defined by the multiindex of the coefficient. A recursion enumerates all numbers of permutations with given descent sets in the form of a Pascal-type triangle. This revised version was published online in August 2006 with corrections to the Cover Date.